Replanning in Robotics
نویسنده
چکیده
Standard procedures of logic programming do not take into account program updates. If the given program is updated during or after the evaluation of a query, the answer to the query is not correct any longer. This paper shows how to use Dynamic SLDNF (DSLDNF), a new extension of SLDNF, which works under changing logic programs in order to construct plans for robot navigation in dynamic environments.
منابع مشابه
A Guide to Heuristic-based Path Planning
We describe a family of recently developed heuristicbased algorithms used for path planning in the real world. We discuss the fundamental similarities between static algorithms (e.g. A*), replanning algorithms (e.g. D*), anytime algorithms (e.g. ARA*), and anytime replanning algorithms (e.g. AD*). We introduce the motivation behind each class of algorithms, discuss their use on real robotic sys...
متن کاملReplanning in Robotics by Dynamic Sldnf
Standard procedures of logic programming do not take into account program updates. If the given program is updated during or after the evaluation of a query, the answer to the query is not correct any longer. This paper shows how to use Dynamic SLDNF (DSLDNF), a new extension of SLDNF, which works under changing logic programs in order to construct plans for robot navigation in dynamic environm...
متن کاملImproved Fast Replanning for Robot Navigation in Unknown Terrain
Mobile robots often operate in domains that are only incompletely known, for example, when they have to move from given start coordinates to given goal coordinates in unknown terrain. In this case, they need to be able to replan quickly as their knowledge of the terrain changes. Stentz’ Focussed Dynamic A* is a heuristic search method that repeatedly determines a shortest path from the current ...
متن کاملReplanning: A Powerful Planning Strategy for Systems with Differential Constraints
Motion planning is a fundamental problem in robotics. When the differential constraints of a real robot are also modelled, the produced motions can be more realistic and make better use of the hardware’s capabilities. While it is not known if planning under differential constraints is a decidable problem and complete tractable algorithms are not available, sampling-based planners have been very...
متن کاملThe Stanford LittleDog: A learning and rapid replanning approach to quadruped locomotion
Legged robots offer the potential to navigate a wide variety of terrains that are inaccessible to wheeled vehicles. In this paper we consider the planning and control tasks of navigating a quadruped robot over a wide variety of challenging terrain, including terrain which it has not seen until run-time. We present a software architecture that makes use of both static and dynamic gaits, as well ...
متن کامل